Computational isomorphisms in classical logic
نویسندگان
چکیده
All standard ‘linear’ boolean equations are shown to be computationally realized within a suitable classical sequent calculus LKp. Specifically, LKp can be equipped with a cut-elimination compatible equivalence on derivations based upon reversibility properties of logical rules. So that any pair of derivations, without structural rules, of F ⇒ G and G ⇒ F , where F , G are first-order formulas ‘without any qualities’, defines a computational isomorphism.
منابع مشابه
Classical isomorphisms of types
The study of isomorphisms of types has been mainly carried out in an intuitionistic setting. We extend some of these works to classical logic for both call-by-name and call-by-value computations by means of polarized linear logic and game semantics. This leads to equational characterizations of these isomorphisms for all the propositional connectives.
متن کاملGame semantics for first-order logic
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style extension of Parigot’s lambda-mu-calculus to represent proofs of first-order classical logic. We present some relations with Krivine’s classical realizability and applications to type isomorphisms.
متن کاملSecond-Order Type Isomorphisms Through Game Semantics
The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question in the case of second-order λμ-calculus, which can be seen as an extension of system F to classical logic, and for which we define a categorical framework: control hyperdoctrines. Our game model of λμ-calculus is based ...
متن کاملFrom Reversible Programs to Univalent Universes and Back
We establish a close connection between a reversible programming language based on type isomorphisms and a formally presented univalent universe. The correspondence relates combinators witnessing type isomorphisms in the programming language to paths in the univalent universe; and combinator optimizations in the programming language to 2-paths in the univalent universe. The result suggests a si...
متن کاملLinear Logic complements Classical Logic
Classical logic enforces the separation of individuals and predicates, linear logic draws them together via interaction; these are not right-orwrong alternatives but dual or complementary logics. Linear logic is an incomplete realization of this duality. While its completion is not essential for the development and maintenance of logic, it is crucial for its application. We outline the “four-sq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 294 شماره
صفحات -
تاریخ انتشار 1996